By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

ALERT ATTENTION: System maintenance will be performed the weekend of Saturday, March 28, 2009. This event will begin at 6:00 am on March 28 and will conclude at approximately 12:00 noon on Sunday March 29 (all times EDT). Some Scitation services may be affected during this period.
Table of Contents
Search This Issue
Volume 18, Issue 1, pp. 1-208

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Amortized Analysis of Algorithms for Set Union with Backtracking

Jeffery Westbrook and Robert E. Tarjan

pp. 1-11

BibTeX  Abstract Full Text:  PDF

The Bit Complexity of Randomized Leader Election on a Ring

Karl Abrahamson, Andrew Adler, Rachel Gelbart, Lisa Higham, and David Kirkpatrick

pp. 12-29

BibTeX  Abstract Full Text:  PDF

A Fast Parametric Maximum Flow Algorithm and Applications

Giorgio Gallo, Michael D. Grigoriadis, and Robert E. Tarjan

pp. 30-55

BibTeX  Abstract Full Text:  PDF

Lower Bounds for Accessing Binary Search Trees with Rotations

Robert Wilber

pp. 56-67

BibTeX  Abstract Full Text:  PDF

An Incremental Linear-Time Algorithm for Recognizing Interval Graphs

Norbert Korte and Rolf H. Möhring

pp. 68-81

BibTeX  Abstract Full Text:  PDF

Minimum Delay Codes

Lawrence L. Larmore

pp. 82-94

BibTeX  Abstract Full Text:  PDF

The Boolean Hierarchy II: Applications

Jin-Yi Cai, Thomas Gundermann, Juris Hartmanis, Lane A. Hemachandra, Vivian Sewelson, Klaus Wagner, and Gerd Wechsung

pp. 95-111

BibTeX  Abstract Full Text:  PDF

Algorithms and Data Structures for an Expanded Family of Matroid Intersection Problems

Greg N. Frederickson and Mandayam A. Srinivas

pp. 112-138

BibTeX  Abstract Full Text:  PDF

Optimal Bin Packing with Items of Random Sizes II

Wansoo T. Rhee and Michel Talagrand

pp. 139-151

BibTeX  Abstract Full Text:  PDF

Minimal Threshold Separators and Memory Requirements for Synchronization

Edward T. Ordman

pp. 152-165

BibTeX  Abstract Full Text:  PDF

Algorithms for Packing Squares: A Probabilistic Analysis

E. G. Coffman, Jr. and J. C. Lagarias

pp. 166-185

BibTeX  Abstract Full Text:  PDF

The Knowledge Complexity of Interactive Proof Systems

Shafi Goldwasser, Silvio Micali, and Charles Rackoff

pp. 186-208

BibTeX  Abstract Full Text:  PDF